Student Seminar Talk PROBABILITY AND MARTINGALES
نویسنده
چکیده
I will introduce some important concepts in probability theory: sub sigma-algebras, conditioning and martingale processes. We will focus on their intuitive meaning with a lot of examples. 1. Basic concepts A probability space is a triple (Ω,F , P ). The elements of F are called events. A random variable is a function X : Ω→ R which is measurable in the sense that X−1A = {X ∈ A} = {ω ∈ Ω : X(ω) ∈ A} ∈ F for every Borel set A ⊂ R. In short notation, X−1B(R) ⊂ F where B(R) is the Borel σ-algebra of R. The σ-algebra generated by X is σ(X) = X−1B(R), this is the smallest sub σ-algebra of F with respect to which X is measurable. 2. Sub σ-algebras 2.1. Intuitive meaning. A sub σ-algebra G ⊂ F represents partial information, in the following sense. We think that ω ∈ Ω has been chosen randomly (according to the probability measure P ), and someone now tells us the values X(ω) for all G-measurable random variables X. In particular, for each event A ∈ G, we know whether A has occurred or not. Example 2.1. Ω = [0, 1] equipped with Borel sets and Lebesgue measure. Let X(ω1, ω2) = ω1. Then for a Borel set A ⊂ [0, 1] X−1A = {(ω1, ω2) : ω1 ∈ A} = A× [0, 1]. hence σ(X) = B([0, 1])× [0, 1]. Example 2.2. Intuitively, If X is a random variable, σ(X) represents the information of knowing X. Let Y = f(X) (meaning Y = f ◦X), where f : R → R is a Borel function. Then Y is σ(X)-measurable. Indeed, {Y ∈ A} = {X ∈ f−1A} ∈ σ(X). One can prove that the converse is also true, if Y is σ(X)-measurable then Y = f(X) for some Borel function f : R → R. Example 2.3. Suppose X1, X2, . . . are random variables over (Ω,F , P ), then
منابع مشابه
Connecting Yule Process, Bisection and Binary Search Tree via Martingales
We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.
متن کاملProbability Theory II
Contents Chapter 1. Martingales, continued 1 1.1. Martingales indexed by partially ordered sets 1 1.2. Notions of convergence for martingales 3 1.3. Uniform integrability 4 1.4. Convergence of martingales with directed index sets 6 1.5. Application: The 0-1 law of Kolmogorov 8 1.6. Continuous-time martingales 9 1.7. Tail bounds for martingales 12 1.8. Application: The Pólya urn 13 1.9. Applicat...
متن کاملCentral Limit Theorem for dynamical systems using martingales
This post is based on notes from Matt Nicol's talk at the UH summer school in dynamical systems. The goal is to present the ideas behind a proof of the central limit theorem for dynamical systems using martingale approximations. Before we can define and use martingales, we must recall the definition of conditional expectation. Let (Ω, P) be a probability space, with P defined on a σ-algebra B. ...
متن کاملProbabilistic Program Analysis with Martingales
We present techniques for the analysis of infinite state probabilistic programs to synthesize probabilistic invariants and prove almost-sure termination. Our analysis is based on the notion of (super) martingales from probability theory. First, we define the concept of (super) martingales for loops in probabilistic programs. Next, we present the use of concentration of measure inequalities to b...
متن کاملBSDEs of Counterparty Risk
We study a BSDE with random terminal time that appears in the modeling of counterparty risk in finance. We model the terminal time as an invariant time, i.e. a time such that local martingales with respect to a reduced filtration and a possibly changed probability measure, once stopped right before that time, stay local martingales with respect to the original model filtration and probability m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007